#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 110, MOD = 100;

LL n;
LL f[N];

void init()
{
	f[0] = 1;
	for(int i = 1;i <= n;i ++)
		for(int j = 0;j <= i - 1;j ++)
			f[i] = (f[i] + f[j] * f[i - 1 - j] % MOD) % MOD;
}

int main()
{
	cin >> n;
	init();
	cout << f[n] << endl;
	return 0;
}